The Class of Series-Parallel Graphs. Part II
نویسنده
چکیده
In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N -free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers. We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and series operations. The goal of the article is to prove the theorem that the class of finite series-parallel graphs is the class of finite N -free graphs. This paper formalizes the next part of [12].
منابع مشابه
The Class of Series - Parallel Graphs . Part II 1 Krzysztof Retel University of Białystok
In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N-free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers. We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and seri...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.
In series-parallel SPN, the completion time distribution...
متن کاملSet a bi-objective redundancy allocation model to optimize the reliability and cost of the Series-parallel systems using NSGA II problem
With the huge global and wide range of attention placed upon quality, promoting and optimize the reliability of the products during the design process has turned out to be a high priority. In this study, the researcher have adopted one of the existing models in the reliability science and propose a bi-objective model for redundancy allocation in the series-parallel systems in accordance with th...
متن کاملCombinatorial problems on series-parallel graphs
We show, in a unified manner, that there exist linear time algorithms for many combinatorial problems defined on the class of series-parallel graphs. These include (i) the decision problem, and (ii) the minimum edge (vertex) deletion problem both with respect to a property characterized by a finite number of forbidden graphs, and (iii) the generalized matching problem.
متن کامل